First passage percolation in Euclidean space and on random tessellations
نویسنده
چکیده
There are various models of first passage percolation (FPP) in R. We want to start a very general study of this topic. To this end we generalize the first passage percolation model on the lattice Z to R and adapt the results of [Boi90] to prove a shape theorem for ergodic random pseudometrics on R. A natural application of this result will be the study of FPP on random tessellations where a fluid starts in the zero cell and takes a random time to pass through the boundary of a cell into a neighbouring cell. We find that a tame random tessellation, as introduced in the companion paper [Zie16], has a positive time constant. This is used to derive a spatial ergodic theorem for the graph induced by the tessellation. Finally we take a look at the Poisson hyperplane tessellation, give an explicit formula to calculate it’s FPP limit shape and bound the speed of convergence in the corresponding shape theorem.
منابع مشابه
First-passage percolation on random geometric graphs and an application to shortest-path trees
We consider Euclidean first-passage percolation on a large family of connected random geometric graphs in the d-dimensional Euclidean space encompassing various well-known models from stochastic geometry. In particular, we establish a strong linear growth property for shortest-path lengths on random geometric graphs which are generated by point processes. We consider the event that the growth o...
متن کاملOn the Markov Transition Kernels for First Passage Percolation on the Ladder
We consider the first passage percolation problem on the random graph with vertex set N×{0, 1}, edges joining vertices at a Euclidean distance equal to unity, and independent exponential edgeweights. We provide a central limit theorem for the first passage times ln between the vertices (0, 0) and (n, 0), thus extending earlier results about the almost-sure convergence of ln/n as n → ∞. We use g...
متن کاملFirst passage percolation on a hyperbolic graph admits bi-infinite geodesics*
Given an infinite connected graph, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges. An open question attributed to Furstenberg ([14]) is whether there exists a bi-infinite geodesic in first passage percolation on the euclidean lattice of dimension at least 2. Although the answer is generally conjectured to be negative, we give a positive answer for graphs sa...
متن کاملTrees, Animals, and Percolation on Hyperbolic Lattices
We study lattice trees, lattice animals, and percolation on non-Euclidean lattices that correspond to regular tessellations of twoand three-dimensional hyperbolic space. We prove that critical exponents of these models take on their mean field values. Our methods are mainly combinatorial and geometric.
متن کاملPercolation on random Johnson–Mehl tessellations and related models
We make use of the recent proof that the critical probability for percolation on random Voronoi tessellations is 1/2 to prove the corresponding result for random Johnson–Mehl tessellations, as well as for twodimensional slices of higher-dimensional Voronoi tessellations. Surprisingly, the proof is a little simpler for these more complicated models.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016